A New Lower Bound for the Football Pool Problem for Six Matches
نویسندگان
چکیده
© Université Bordeaux 1, 1996, tous droits réservés. L’accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
منابع مشابه
A new lower bound for the football pool problem for 7 matchespar
A new lower bound for the football pool problem for 7 matches par Laurent HABSIEGER 1 R esum e. Notons K 3 (7; 1) le cardinal minimal d'un code ternaire de longueur 7 et de rayon de recouvrement un. Dans un pr ec edent article, nous avons am elior e la minoration K 3 (7; 1) 147 en montrant que K 3 (7; 1) 150. Dans cette note, nous prouvons que K 3 (7; 1) 153. Abstract. Let K 3 (7; 1) denote the...
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملRanking World Cup 2014 Football Matches by Data Envelopment Analysis Models with Common Weights
Football is one of the most popular and exciting sports fields throughout the world. Today, in addition to the result, the number of goals and points, attraction and quality of the played matches are important for club management staff, coaching staff, the players and especially the fans. Beside number of goals, there are different criteria such as successful passes, attacks, defenses, tackles ...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملThe Inverse Football Pool Problem
The minimal number of spheres (without “interior”) of radius n required to cover the finite set {0, . . . , q−1} equipped with the Hamming distance is denoted by T (n, q). The only hitherto known values of T (n, q) are T (n, 3) for n = 1, . . . , 6. These were all given in the 1950s in the Finnish football pool magazine Veikkaaja along with upper and lower bounds for T (n, 3) for n ≥ 7. Recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 99 شماره
صفحات -
تاریخ انتشار 2002